Rigidity of a simple extended lower triangular matrix

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rigidity of a simple extended lower triangular matrix

For the all-ones lower triangular matrices, the upper and lower bounds on rigidity are known to match [13]. In this short note, we apply these techniques to the allones extended lower triangular matrices, to obtain upper and lower bounds with a small gap between the two; we show that the rigidity is θ( 2 r ).

متن کامل

Extended Triangular Operational Matrix For Solving Fractional Population Growth Model

  In this paper, we apply the extended triangular operational matrices of fractional order to solve the fractional voltrra model for population growth of a species in a closed system. The fractional derivative is considered in the Caputo sense. This technique is based on generalized operational matrix of triangular functions. The introduced method reduces the proposed problem for solving a syst...

متن کامل

The inverse along a lower triangular matrix

In this paper, we investigate the recently defined notion of inverse along an element in the context of matrices over a ring. Precisely, we study the inverse of a matrix along a lower triangular matrix, under some conditions.

متن کامل

Lower Bounds on Matrix Rigidity Via a Quantum Argument

The rigidity of a matrix measures how many of its entries need to be changed in order to reduce its rank to some value. Good lower bounds on the rigidity of an explicit matrix would imply good lower bounds for arithmetic circuits as well as for communication complexity. Here we reprove the best known bounds on the rigidity of the Hadamard matrix, due to Kashin and Razborov, using tools from qua...

متن کامل

Ela a Simple Closed Form for Triangular Matrix Powers∗

1. The algorithm. Huang [1] gives an algorithm for computing the powers of a triangular matrix where the diagonal elements are unique. However, in contrast to Huang’s algorithm, the method presented here has the unique advantage of producing the result in closed form, which shows explicitly how the behavior of any element of the matrix varies with varying powers of the matrix. Also, the closed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 2008

ISSN: 0020-0190

DOI: 10.1016/j.ipl.2008.02.010